Fast Kötter-Nielsen-Høholdt Interpolation in the Guruswami-Sudan Algorithm
نویسنده
چکیده
The Kötter–Nielsen–Høholdt algorithm is a popular way to construct the bivariate interpolation polynomial in the Guruswami–Sudan decoding algorithm for Reed–Solomon codes. In this paper, we show how one can use Divide & Conquer techniques to provide an asymptotic speed-up of the algorithm, rendering its complexity quasi-linear in n. Several of our observations can also provide a practical speed-up to the classical version of the algorithm.
منابع مشابه
The Guruswami–Sudan Decoding Algorithm for Reed–Solomon Codes
This article is a tutorial discussion of the Guruswami–Sudan (GS) Reed–Solomon decoding algorithm, including self-contained treatments of the Kötter and Roth– Ruckenstein (RR) improvements. It also contains a number of new results, including a rigorous discussion of the average size of the decoder’s list, an improvement in the RR algorithm’s stopping rule, a simplified treatment of the combinat...
متن کاملPrefactor Reduction of the Guruswami-Sudan Interpolation Step
The concept of prefactors is considered in order to decrease the complexity of the Guruswami–Sudan interpolation step for generalized Reed–Solomon codes. It is shown that the well-known re-encoding projection due to Kötter et al. [1] leads to one type of such prefactors. The new type of Sierpinski prefactors is introduced. The latter are based on the fact that many binomial coefficients in the ...
متن کاملInterpolation in list decoding of Reed-Solomon codes
The problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes is considered. It is shown that it can be implemented by computing the product of the ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of zero-dimensional co-prime ideals product is pro...
متن کاملOn the Interpolation Step in the Guruswami-Sudan List Decoding Algorithm for Reed-Solomon Codes
Divide-and-conquer method for interpolation in Guruswami-Sudan (GS) list decoding algorithm is considered. It is shown that the Groebner basis (GB) of the ideal of bivariate interpolation polynomials (IP) can be obtained as a product of trivariate polynomials corresponding to disjoint subsets of interpolation points. The impact of monomial ordering on the interpolation complexity is studied.
متن کاملA Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
Let F q be a finite field with q elements and C ⊂ F n q a code of length n. If c ∈ C and h = (h 1 h 2 · · · h n) is a row of a parity check matrix of C, then it is clear that h · c = 0. Such parity checks can therefore be used to test if a given word w ∈ F n q is an element of C, but it turns out that the expressions h · w (usually called syndromes of w) can be useful in decoding algorithms as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1406.0053 شماره
صفحات -
تاریخ انتشار 2014